- running time of such algorithms
- Программирование: время выполнения подобных алгоритмов
Универсальный англо-русский словарь. Академик.ру. 2011.
running time of such algorithms
Смотреть что такое "running time of such algorithms" в других словарях:
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example … Wikipedia
Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… … Wikipedia
Analysis of algorithms — To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is… … Wikipedia
Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… … Wikipedia
Real-time operating system — A real time operating system (RTOS; generally pronounced as are toss ) is a multitasking operating system intended for real time applications. Such applications include embedded systems (programmable thermostats, household appliance controllers,… … Wikipedia
Exponential time — In complexity theory, exponential time is the computation time of a problem where the time to complete the computation, m ( n ), is bounded by an exponential function of the problem size, n . In other words, as the size of the problem increases… … Wikipedia
Linear time — In computational complexity theory, an algorithm is said to take linear time, or O( n ) time, if the asymptotic upper bound for the time it requires is proportional to the size of the input, which is usually denoted n . Informally spoken, the… … Wikipedia
Pseudo-polynomial time — In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… … Wikipedia
One-time pad — Excerpt from a one time pad In cryptography, the one time pad (OTP) is a type of encryption, which has been proven to be impossible to crack if used correctly. Each bit or character from the plaintext is encrypted by a modular addition with a bit … Wikipedia
Secure Real-time Transport Protocol — The Secure Real time Transport Protocol (or SRTP) defines a profile of RTP (Real time Transport Protocol), intended to provide encryption, message authentication and integrity, and replay protection to the RTP data in both unicast and multicast… … Wikipedia
